A penalty-free approach to PDE constrained optimization: application to an inverse wave problem

نویسندگان

چکیده

Abstract Inverse wave problems (IWPs) amount in non-linear optimization where a certain distance between state variable and some observations of wavefield is to be minimized. Additionally, we require the solution model equation that involves set parameters optimized. Typical approaches solve IWPs includes adjoint method , which generates sequence strictly enforces at each iteration, and, reconstruction inversion (WRI) method, jointly but does not enforce model. WRI considered an interesting approach because, by virtue enforcing it expands search space, can thus find solutions may found typical method. However, techniques generally requires tuning penalty parameter until satisfied. Alternatively, fixed chosen but, such case, impossible for algorithm satisfies exactly. In present work, a, our knowledge, novel technique type variable, loosely The based on TR-SQP aims minimizing, both residual relative linearized quadratic approximation cost functional. Our approximately solves subproblems using Krylov Hessian-vector product computed second-order . demonstrated synthetic with configuration relevant medical imaging.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An inexact ℓ1 penalty SQP algorithm for PDE-constrained optimization with an application to shape optimization in linear elasticity

We develop an optimization algorithm which is able to deal with inexact evaluations of the objective function. The proposed algorithm employs sequential quadratic programming with a line search that uses the l1 penalty function for an Armijo-like condition. Both the objective gradient computations for the quadratic subproblems and the objective function computations for the line search admit so...

متن کامل

A Low-Rank in Time Approach to PDE-Constrained Optimization

The solution of time-dependent PDE-constrained optimization problems is a challenging task in numerical analysis and applied mathematics. All-at-once discretizations and corresponding solvers provide efficient methods to robustly solve the arising discretized equations. One of the drawbacks of this approach is the high storage demand for the vectors representing the discrete space-time cylinder...

متن کامل

solution of security constrained unit commitment problem by a new multi-objective optimization method

چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...

An Alternative Approach for PDE-Constrained Optimization via Genetic Algorithm

This paper deals with an alternative approach for solving the PDE-constrained optimization problems. For this purpose, the problem has been discretized with the help of finite difference method. Then the reduced problem has been solved by advanced real coded genetic algorithm with ranking selection, whole-arithmetic crossover and non uniform mutation. The proposed approach has been illustrated ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Inverse Problems

سال: 2021

ISSN: ['0266-5611', '1361-6420']

DOI: https://doi.org/10.1088/1361-6420/abe4a9